303 research outputs found
Study of System with RC Model Servos
CĂlem tĂŠto bakalĂĄĹskĂŠ prĂĄce bylo prozkoumat jak fungujĂ modelĂĄĹskĂĄ serva a jak je moĹžnĂŠ je ovlĂĄdat pomocĂ poÄĂtaÄe. V prĂĄci byl vytvoĹen pohyblivĂ˝ stojĂĄnek pro kameru nebo fotoaparĂĄt, urÄenĂ˝ k zabudovĂĄnĂ do modelu letadla. K ĹĂzenĂ serv je vyuĹžita deska Arduino.The goal of this bachelor's thesis was to investigate how works modeller servos and how they can be controlled by a computer. In this thesis was created movable stand for camera, intended for installation in aircraft model. The servos are controlled by Arduino board.
Design and evaluation of the impact of pretensionable cable bolts on the stability of mining works in the terms of temporal evolution
PĹedloĹženĂĄ prĂĄce se zamÄĹuje obecnÄ na kotvenĂ podzemnĂch konstrukcĂ se zvlĂĄĹĄtnĂm zamÄĹenĂm na tzv. vysokĂŠ kotvenĂ v hlubinnĂŠm ÄernouhelnĂŠm hornictvĂ Ostravsko-karvinskĂŠho revĂru pĹi zesilovĂĄnĂ vĂ˝ztuĹže dlouhĂ˝ch dĹŻlnĂch dÄl. PrĂĄce se zabĂ˝vĂĄ teoriĂ kotvenĂ, vlivem kot-venĂ na konstrukci a horskĂ˝ masiv, ztrĂĄtami pĹedpÄtĂ v kotvĂĄch a chovĂĄnĂm kotev pĹĂmo v dĹŻlnĂch podmĂnkĂĄch.
Pro dosaĹženĂ výťe uvedenĂ˝ch cĂlĹŻ bylo na nÄkolika dlouhĂ˝ch dĹŻlnĂch dĂlech v Ostravsko-karvinskĂŠm revĂru provĂĄdÄno mÄĹenĂ sil v kotvĂĄch a konvergencĂ profilĹŻ dĹŻlnĂch dÄl. MÄĹenĂ ztrĂĄt pĹedpÄtĂ v Äase a výťe vstupnĂho pĹedpÄtĂ probĂhalo pomocĂ laboratornĂho modelu.
CĂlem tĂŠto prĂĄce je nejen vyhodnocenĂ zĂskanĂ˝ch a zpracovanĂ˝ch poznatkĹŻ z chovĂĄnĂ lanovĂ˝ch, Äi pramencovĂ˝ch kotev pĹi vedenĂ dĹŻlnĂch dÄl a nĂĄslednĂŠm dobĂ˝vĂĄnĂ souvisejĂcĂch porubĹŻ, ale i doporuÄenĂ pro technologii vysokĂŠho kotvenĂ k jejĂ vyĹĄĹĄĂ efektivitÄ. ZvlĂĄĹĄtnĂ po-zornost je vÄnovĂĄna problematice krĂĄtkodobĂ˝ch a dlouhodobĂ˝ch ztrĂĄt pĹedpÄtĂ v kotevnĂch prvcĂch a jejich omezenĂ.The thesis is focused generally on anchoring of underground structures with particular focus on the so-called âhigh anchoringâ in Ostrava-KarvinĂĄ coalfield fort strenghtening the steel arch support of mine workings. The work deals with anchoring theory, anchoring influ-ence on the construction, respectively rock mass and losses of prestressing in the anchors, inc-luding some practical experience with cable bolts behaviour in real conditions of coal mines.
To achieve the following goals forces in the anchors and convergence of profiles of mine workings have been measured in several workings in the Ostrava-Karvina coalfield. Prestres-sing losses have been measured using a laboratory model.
The aim of this work is not only the evaluation of the learned and processed experience from the cablebolts in mine workings and related coal face extraction, but also recommendati-ons for higher efficiency of high anchoring considering the conditions of application and re-duction of prestressing losses.224 - Katedra geotechniky a podzemnĂho stavitelstvĂvyhovÄ
Chess Program with Various Chess Variations with Various Initial Arrangement
Tato prĂĄce se zabĂ˝vĂĄ rozborem vĹĄech komponent potĹebnĂ˝ch pro implementaci modernĂho ĹĄachovĂŠho programu. CĂlem je implementace nÄkolika ĹĄachovĂ˝ch variant za pouĹžitĂ struktur a algoritmĹŻ pouĹžĂvanĂ˝ch v profesionĂĄlnĂch ĹĄachovĂ˝ch programech. PrĂĄce se zabĂ˝vĂĄ principem reprezentace ĹĄachovnice v poÄĂtaÄi a faktory hodnocenĂ stavu hry jak v klasickĂŠm ĹĄachu, tak v implementovanĂ˝ch variantĂĄch. Nakonec obsahuje popis a srovnĂĄnĂ rozhodovacĂch algoritmĹŻ a jejich rozĹĄĂĹenĂ.This thesis focuses on describing required components in the process of creation of modern chess application. Goal is to create chess program with several chess variations using structures and algorithms based on professional chess programs. Thesis describes principles of chessboard representation and various factors of chessboard state evaluation used in classic chess and implemented variants. Finally thesis describes game-tree search algorithms and enhancements and compares their effect.
Quality and competition.
ZamÄĹenĂ na problematiku Kvality a Konkurenceschopnosti by mÄlo bĂ˝t samozĹejmostĂ vĹĄech podnikĹŻ. Zajistit kvalitu a tĂm uspokojit zĂĄkaznĂka ve formÄ zavedenĂm ISO norem a jejich dĹŻraznĂ˝m dodrĹžovĂĄnĂm a kontrolou. DlouhodobĂĄ konkurenceschopnost se zajistĂ tĂm, Ĺže se jiĹž dÄti budou vychovĂĄvat k celoĹživotnĂmu vzdÄlĂĄvĂĄnĂ. JazykovĂŠ vzdÄlĂĄvĂĄnĂ musĂ bĂ˝t samozĹejmost, kterĂŠ se bude uÄit jiĹž v mateĹskĂ˝ch ĹĄkolĂĄch. PropojenĂ politiky stĂĄtu v otĂĄzkĂĄch infrastruktur a vzdÄlĂĄvĂĄnĂ, pĹinese z pohledu budoucnosti pozitivum tĂm, Ĺže se tovĂĄrny nebudou pĹesouvat dĂĄle na VĂ˝chod, ale budou dĂĄle zamÄstnĂĄvat naĹĄe âlidiâ. NesmĂ se brĂĄnit InovacĂm a vklĂĄdat do nich prostĹedky, kterĂŠ nĂĄm z efektivnĂ vĂ˝robu. PĹitom se musĂ klĂĄst velkĂ˝ dĹŻraz na BezpeÄnost prĂĄce. NemÄlo by se myslet jen na krĂĄtkodobĂ˝ zisk, ale mÄl by na to bĂ˝t pohled budoucnosti. SpoleÄnost se bude dĂĄle vytvĂĄĹet a vyvĂjet. NemĹŻĹže zĹŻstat pouze teÄ ve vytvoĹenĂŠm systĂŠmu. Je potĹeba neustĂĄle drĹžet krok s pokrokem a dĂĄt zelenou novĂ˝m technologiĂm a zajisti prĂĄvÄ prosperitu naĹĄim potomkĹŻm.This bachelor thesis deals with problems of quality and competitive strength. Here is enlarged the way how to ensure the quality and to satisfy the customer by implementig, following and checking of ISO standards. Satisfaction of the customer brings the potentiality into the company. The only way is to bring up our children for the lifelong learning. Education in languages should be on very high level and languages should be taught even in kindergartens. Crossconnection of the government´s policies in infrastructures and education will have positive influence on our future life, factories will not move to East, they will stay here and employ our people. To be open to innovation and not hesitate to lay resources into it. This is the only way to obtain more effective production. We shouldn´t forget the safety of work and follow the severe laws and standards.The heritage for following generations will depend on our attitude to quality problems and to competitive strength.We cannot think only of short-term profit, but also of the future.The society will be permanently created and developed.The society will be permanently created and developed. We cannot stay on one place in this created system.It is necessary to follow the progress in the world and give priority to new technologies and ensure the prosperity for our descendants.
Brain Tumor Detection and Segmentation in Multisequence MRI
Tato prĂĄce se zabĂ˝vĂĄ detekcĂ a segmentacĂ mozkovĂŠho nĂĄdoru v multisekvenÄnĂch MR obrazech se zamÄĹenĂm na gliomy vysokĂŠho a nĂzkĂŠho stupnÄ malignity. Jsou zde pro tento ĂşÄel navrĹženy tĹi metody. PrvnĂ metoda se zabĂ˝vĂĄ detekcĂ prezence ÄĂĄstĂ mozkovĂŠho nĂĄdoru v axiĂĄlnĂch a koronĂĄrnĂch Ĺezech. JednĂĄ se o algoritmus zaloĹženĂ˝ na analĂ˝ze symetrie pĹi rĹŻznĂ˝ch rozliĹĄenĂch obrazu, kterĂ˝ byl otestovĂĄn na T1, T2, T1C a FLAIR obrazech. DruhĂĄ metoda se zabĂ˝vĂĄ extrakcĂ oblasti celĂŠho mozkovĂŠho nĂĄdoru, zahrnujĂcĂ oblast jĂĄdra tumoru a edĂŠmu, ve FLAIR a T2 obrazech. Metoda je schopna extrahovat mozkovĂ˝ nĂĄdor z 2D i 3D obrazĹŻ. Je zde opÄt vyuĹžita analĂ˝za symetrie, kterĂĄ je nĂĄsledovĂĄna automatickĂ˝m stanovenĂm intenzitnĂho prahu z nejvĂce asymetrickĂ˝ch ÄĂĄstĂ. TĹetĂ metoda je zaloĹžena na predikci lokĂĄlnĂ struktury a je schopna segmentovat celou oblast nĂĄdoru, jeho jĂĄdro i jeho aktivnĂ ÄĂĄst. Metoda vyuĹžĂvĂĄ faktu, Ĺže vÄtĹĄina lĂŠkaĹskĂ˝ch obrazĹŻ vykazuje vysokou podobnost intenzit sousednĂch pixelĹŻ a silnou korelaci mezi intenzitami v rĹŻznĂ˝ch obrazovĂ˝ch modalitĂĄch. JednĂm ze zpĹŻsobĹŻ, jak s touto korelacĂ pracovat a pouĹžĂvat ji, je vyuĹžitĂ lokĂĄlnĂch obrazovĂ˝ch polĂ. PodobnĂĄ korelace existuje takĂŠ mezi sousednĂmi pixely v anotaci obrazu. Tento pĹĂznak byl vyuĹžit v predikci lokĂĄlnĂ struktury pĹi lokĂĄlnĂ anotaci polĂ. Jako klasifikaÄnĂ algoritmus je v tĂŠto metodÄ pouĹžita konvoluÄnĂ neuronovĂĄ sĂĹĽ vzhledem k jejĂ znĂĄme schopnosti zachĂĄzet s korelacĂ mezi pĹĂznaky. VĹĄechny tĹi metody byly otestovĂĄny na veĹejnĂŠ databĂĄzi 254 multisekvenÄnĂch MR obrazech a byla dosĂĄhnuta pĹesnost srovnatelnĂĄ s nejmodernÄjĹĄĂmi metodami v mnohem kratĹĄĂm vĂ˝poÄetnĂm Äase (v ĹĂĄdu sekund pĹi pouĹžitĂ˝ CPU), coĹž poskytuje moĹžnost manuĂĄlnĂch Ăşprav pĹi interaktivnĂ segmetaci.This work deals with the brain tumor detection and segmentation in multisequence MR images with particular focus on high- and low-grade gliomas. Three methods are propose for this purpose. The first method deals with the presence detection of brain tumor structures in axial and coronal slices. This method is based on multi-resolution symmetry analysis and it was tested for T1, T2, T1C and FLAIR images. The second method deals with extraction of the whole brain tumor region, including tumor core and edema, in FLAIR and T2 images and is suitable to extract the whole brain tumor region from both 2D and 3D. It also uses the symmetry analysis approach which is followed by automatic determination of the intensity threshold from the most asymmetric parts. The third method is based on local structure prediction and it is able to segment the whole tumor region as well as tumor core and active tumor. This method takes the advantage of a fact that most medical images feature a high similarity in intensities of nearby pixels and a strong correlation of intensity profiles across different image modalities. One way of dealing with -- and even exploiting -- this correlation is the use of local image patches. In the same way, there is a high correlation between nearby labels in image annotation, a feature that has been used in the ``local structure prediction'' of local label patches. Convolutional neural network is chosen as a learning algorithm, as it is known to be suited for dealing with correlation between features. All three methods were evaluated on a public data set of 254 multisequence MR volumes being able to reach comparable results to state-of-the-art methods in much shorter computing time (order of seconds running on CPU) providing means, for example, to do online updates when aiming at an interactive segmentation.
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
We study the Steiner Tree problem, in which a set of terminal vertices needs
to be connected in the cheapest possible way in an edge-weighted graph. This
problem has been extensively studied from the viewpoint of approximation and
also parametrization. In particular, on one hand Steiner Tree is known to be
APX-hard, and W[2]-hard on the other, if parameterized by the number of
non-terminals (Steiner vertices) in the optimum solution. In contrast to this
we give an efficient parameterized approximation scheme (EPAS), which
circumvents both hardness results. Moreover, our methods imply the existence of
a polynomial size approximate kernelization scheme (PSAKS) for the considered
parameter.
We further study the parameterized approximability of other variants of
Steiner Tree, such as Directed Steiner Tree and Steiner Forest. For neither of
these an EPAS is likely to exist for the studied parameter: for Steiner Forest
an easy observation shows that the problem is APX-hard, even if the input graph
contains no Steiner vertices. For Directed Steiner Tree we prove that
approximating within any function of the studied parameter is W[1]-hard.
Nevertheless, we show that an EPAS exists for Unweighted Directed Steiner Tree,
but a PSAKS does not. We also prove that there is an EPAS and a PSAKS for
Steiner Forest if in addition to the number of Steiner vertices, the number of
connected components of an optimal solution is considered to be a parameter.Comment: 23 pages, 6 figures An extended abstract appeared in proceedings of
STACS 201
- âŚ